skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Seelinger, G"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available June 10, 2026
  2. We prove and extend the longest-standing conjecture in ‘ q , t q,t -Catalan combinatorics,’ namely, the combinatorial formula for ∇<#comment/> m s μ<#comment/> \nabla ^m s_{\mu } conjectured by Loehr and Warrington, where s μ<#comment/> s_{\mu } is a Schur function and ∇<#comment/> \nabla is an eigenoperator on Macdonald polynomials. Our approach is to establish a stronger identity of infinite series of G L l GL_l characters involvingSchur Catalanimals; these were recently shown by the authors to represent Schur functions s μ<#comment/> [ −<#comment/> M X m , n ] s_{\mu }[-MX^{m,n}] in subalgebras Λ<#comment/> ( X m , n ) ⊂<#comment/> E \Lambda (X^{m,n})\subset \mathcal {E} isomorphic to the algebra of symmetric functions Λ<#comment/> \Lambda over Q ( q , t ) \mathbb {Q} (q,t) , where E \mathcal {E} is the elliptic Hall algebra of Burban and Schiffmann. We establish a combinatorial formula for Schur Catalanimals as weighted sums of LLT polynomials, with terms indexed by configurations of nested lattice paths callednests, having endpoints and bounding constraints controlled by data called aden. The special case for Λ<#comment/> ( X m , 1 ) \Lambda (X^{m,1}) proves the Loehr-Warrington conjecture, giving ∇<#comment/> m s μ<#comment/> \nabla ^m s_{\mu } as a weighted sum of LLT polynomials indexed by systems of nested Dyck paths. In general, for Λ<#comment/> ( X m , n ) \Lambda (X^{m,n}) our formula implies a new ( m , n ) (m,n) version of the Loehr-Warrington conjecture. In the case where each nest consists of a single lattice path, the nests in a den formula reduce to our previous shuffle theorem for paths under any line. Both this and the ( m , n ) (m,n) Loehr-Warrington formula generalize the ( k m , k n ) (km,kn) shuffle theorem proven by Carlsson and Mellit (for n = 1 n=1 ) and Mellit. Our formula here unifies these two generalizations. 
    more » « less
    Free, publicly-accessible full text available June 10, 2026
  3. Abstract We give an explicit raising operator formula for the modified Macdonald polynomials$$\tilde {H}_{\mu }(X;q,t)$$, which follows from our recent formula for$$\nabla $$on an LLT polynomial and the Haglund-Haiman-Loehr formula expressing modified Macdonald polynomials as sums of LLT polynomials. Our method just as easily yields a formula for a family of symmetric functions$$\tilde {H}^{1,n}(X;q,t)$$that we call$$1,n$$-Macdonald polynomials, which reduce to a scalar multiple of$$\tilde {H}_{\mu }(X;q,t)$$when$$n=1$$. We conjecture that the coefficients of$$1,n$$-Macdonald polynomials in terms of Schur functions belong to$${\mathbb N}[q,t]$$, generalizing Macdonald positivity. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026